A tree structure used to search a database that self adjusts. When a branch point (node) in a splay tree is accessed, it is rotated or "splayed" to the root, changing the tree's structure. Because the pointers to the most frequently accessed records are moved closer to the starting point of the tree, those records will be located faster the next time they are searched. See
quad tree and
binary tree.